Minmax strongly connected subgraphs with node penalties
نویسنده
چکیده
We propose an O(min{m+n logn,m log∗n}) to find a minmax strongly connected spanning subgraph of a digraph with n nodes and m arcs. A generalization of this problem called the minmax strongly connected subgraph problem with node penalties is also considered. An O(m logn) algorithm is proposed to solve this general problem. We also discuss ways to improve the average complexity of this algorithm.
منابع مشابه
A Class of Orientation-Invariant Yao-type Subgraphs of a Unit Disk Graph
We introduce a generalization of the Yao graph where the cones used are adaptively centered on a set of nearest neighbors for each node, thus creating a directed or undirected spanning subgraph of a given unit disk graph (UDG). We also permit the apex of the cones to be positioned anywhere along the line segment between the node and its nearest neighbor, leading to a class of Yao-type subgraphs...
متن کاملSupervised feature selection in graphs with path coding penalties and network flows
We consider supervised learning problems where the features are embedded in a graph, such as gene expressions in a gene network. In this context, it is of much interest to automatically select a subgraph with few connected components; by exploiting prior knowledge, one can indeed improve the prediction performance or obtain results that are easier to interpret. Regularization or penalty functio...
متن کاملPath Coding Penalties for Directed Acyclic Graphs
We consider supervised learning problems where the features are embedded in a graph, such as gene expressions in a gene network. In this context, it is of much interest to automatically select a subgraph which has a small number of connected components, either to improve the prediction performance, or to obtain better interpretable results. Existing regularization or penalty functions for this ...
متن کاملHereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs
Recently nmch at tent ion has been focused on the theory of quasi-random graph and hypergraph properties. The class of quasi-random graphs is defined by certain equivalent graph properties possessed by random graphs. We shall investigate properties P which do not imply quasi-randomness for sequences (Gn) of graphs on their own, but do imply if they hold not only for the whole graph Gn but also ...
متن کاملFinding k-Connected Subgraphs with Minimum Average Weight
We consider the problems of finding k-connected spanning subgraphs with minimum average weight. We show that the problems are NP-hard for k > 1. Approximation algorithms are given for four versions of the minimum average edge weight problem: 1. 3-approximation for k-edge-connectivity, 2. O(logk) approximation for k-node-connectivity 3. 2+ approximation for k-node-connectivity in Euclidian graph...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JAMDS
دوره 9 شماره
صفحات -
تاریخ انتشار 2005